An implicit-function theorem for a class of monotone generalized equations

نویسندگان

  • Walter Alt
  • Iosif Kolumbán
چکیده

Implicit-function theorems for generalized equations play an important role in many applications, especially in the stability and sensitivity analysis of variational inequalities and optimization problems and in the convergence analysis of numerical algorithms solving such problems. We refer for instance to Fiacco [7] and Ioffe and Tihomirov [9] for applications of the classical implicit-function theorem in this context. Further results and some extensions of the classical implicit-function theorem can be found in Fiacco [8]. In [15] Robinson proved an implicit-function theorem for a class of generalized equations which he called strongly regular. This result has been widely used in the stability and sensitivity analysis of optimization and optimal control problems (see e.g. Robinson [15, 16], Alt [1, 2], Ito-Kunisch [10], Malanowski [13]) and in the convergence analysis of algorithms solving optimization problems and variational inequalities (see e.g. Robinson [16], Alt [1, 2]). In a recent paper [17], Robinson could extend his implicit-function theorem to a class of nonsmooth functions. In [11, 12] Kassay and Kolumban derived implicit-function theorems for a class of generalized equations defined by a monotone set-valued mapping. They have shown that from these theorems the classical implicit function theorem and Browder's surjectivity theorem can be easily derived. They also presented applications to variational inequalities. The aim of the present paper is to further develop the rather general implicitfunction theorem of Kassay and Kolumban [12] in view of applications to variational inequalities and a class of generalized equations defined by nonsmooth functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENERALIZED POSITIVE DEFINITE FUNCTIONS AND COMPLETELY MONOTONE FUNCTIONS ON FOUNDATION SEMIGROUPS

A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...

متن کامل

Stability analysis of impulsive fuzzy differential equations with finite delayed state

In this paper we introduce some stability criteria for impulsive fuzzy system of differential equations with finite delay in states. Firstly, a new comparison principle for fuzzy differential system compared to crisp ordinary differential equation, based on a notion of upper quasi-monotone nondecreasing, in N dimentional state space is presented. Furthermore, in order to analyze the stability o...

متن کامل

The existence result of a fuzzy implicit integro-differential equation in semilinear Banach space

In this paper‎, ‎the existence and uniqueness of the ‎solution of a nonlinear fully fuzzy implicit integro-differential equation‎ ‎arising in the field of fluid mechanics is investigated. ‎First,‎ an equivalency lemma ‎is ‎presented ‎by‎ which the problem understudy ‎is ‎converted‎ to ‎the‎ two different forms of integral equation depending on the kind of differentiability of the solution. Then...

متن کامل

Autoconvolution equations and generalized Mittag-Leffler ‎functions

This article is devoted to study of the autoconvolution equations and generalized Mittag-Leffler functions. These types of equations are given in terms of the Laplace transform convolution of a function with itself. We state new classes of the autoconvolution equations of the first kind and show that the generalized Mittag-Leffler functions are solutions of these types of equations. In view of ...

متن کامل

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Kybernetika

دوره 29  شماره 

صفحات  -

تاریخ انتشار 1993